fixed point combinator - определение. Что такое fixed point combinator
Diclib.com
Словарь ChatGPT
Введите слово или словосочетание на любом языке 👆
Язык:

Перевод и анализ слов искусственным интеллектом ChatGPT

На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:

  • как употребляется слово
  • частота употребления
  • используется оно чаще в устной или письменной речи
  • варианты перевода слова
  • примеры употребления (несколько фраз с переводом)
  • этимология

Что (кто) такое fixed point combinator - определение

HIGHER-ORDER FUNCTION Y FOR WHICH Y F = F (Y F)
Paradoxical combinator; Y operator; Fixed point operator; U combinator; Curry's paradoxical combinator; Fixed-point operator; Fixpoint combinator; Anonymous fixpoint; Fixpoint operator; Fixed point combinator
Найдено результатов: 4019
Fixed-point combinator         
In mathematics and computer science in general, a fixed point of a function is a value that is mapped to itself by the function.
fixed point combinator         
<mathematics> (Y) The name used in combinatory logic for the fixed point function, also written as "fix". (1994-10-20)
Fixed float         
COMPUTER FORMAT FOR REPRESENTING REAL NUMBERS
Fixed Precision; Fixed point (computing); Fixed point arithmetic; Fixed point numbers; Fixed point number; Fixed-point math; Binary scaling; Fixed precision; Fixed-point number; Fixed float; User:Rahul.deshmukhpatil/Fixed float; Fixed-precision arithmetic; Hardware support for fixed-point arithmetic; Power-of-two scaling; Power-of-2 scaling; Binary-point scaling; Binary-point-only scaling; B notation (fixed point format); B notation (binary scaling); B-notation (fixed point format); B-notation (binary scaling)
In computing, fixed float describes a method of representing real numbers in a way that number and decimal point value is stored at different location or bytes in a memory allocated to variable unlike floating point. In a typical 4 byte (on little endian platform) fixed float number lower(lsb) 2 bytes are used to store the decimal part of the number just like integer value.
Fixed-point arithmetic         
COMPUTER FORMAT FOR REPRESENTING REAL NUMBERS
Fixed Precision; Fixed point (computing); Fixed point arithmetic; Fixed point numbers; Fixed point number; Fixed-point math; Binary scaling; Fixed precision; Fixed-point number; Fixed float; User:Rahul.deshmukhpatil/Fixed float; Fixed-precision arithmetic; Hardware support for fixed-point arithmetic; Power-of-two scaling; Power-of-2 scaling; Binary-point scaling; Binary-point-only scaling; B notation (fixed point format); B notation (binary scaling); B-notation (fixed point format); B-notation (binary scaling)
In computing, fixed-point refers to a method of representing fractional (non-integer) numbers by storing a fixed number of digits of their fractional part. Dollar amounts, for example, are often stored with exactly two fractional digits, representing the cents (1/100 of dollar).
Brouwer Fixed-Point Theorem         
  • For flows in an unbounded area, or in an area with a "hole", the theorem is not applicable.
  • The theorem applies to any disk-shaped area, where it guarantees the existence of a fixed point.
  • right
EVERY CONTINUOUS FUNCTION ON A COMPACT SET HAS A FIXED POINT
Brouwer Fixed Point Theorem; Brouwer's fixed-point theorem; Brouwer theorem; Brouwer's theorem; Brouwer's fixed point theorem; Brouwer fixed point theorem; Brouwer fixed-point; Brouwer’s fixed point theorem
<topology> A well-known result in topology stating that any continuous transformation of an n-dimensional disk must have at least one fixed point. [Is this correct?] (2001-03-29)
Brouwer fixed-point theorem         
  • For flows in an unbounded area, or in an area with a "hole", the theorem is not applicable.
  • The theorem applies to any disk-shaped area, where it guarantees the existence of a fixed point.
  • right
EVERY CONTINUOUS FUNCTION ON A COMPACT SET HAS A FIXED POINT
Brouwer Fixed Point Theorem; Brouwer's fixed-point theorem; Brouwer theorem; Brouwer's theorem; Brouwer's fixed point theorem; Brouwer fixed point theorem; Brouwer fixed-point; Brouwer’s fixed point theorem

Brouwer's fixed-point theorem is a fixed-point theorem in topology, named after L. E. J. (Bertus) Brouwer. It states that for any continuous function f {\displaystyle f} mapping a compact convex set to itself there is a point x 0 {\displaystyle x_{0}} such that f ( x 0 ) = x 0 {\displaystyle f(x_{0})=x_{0}} . The simplest forms of Brouwer's theorem are for continuous functions f {\displaystyle f} from a closed interval I {\displaystyle I} in the real numbers to itself or from a closed disk D {\displaystyle D} to itself. A more general form than the latter is for continuous functions from a convex compact subset K {\displaystyle K} of Euclidean space to itself.

Among hundreds of fixed-point theorems, Brouwer's is particularly well known, due in part to its use across numerous fields of mathematics. In its original field, this result is one of the key theorems characterizing the topology of Euclidean spaces, along with the Jordan curve theorem, the hairy ball theorem, the invariance of dimension and the Borsuk–Ulam theorem. This gives it a place among the fundamental theorems of topology. The theorem is also used for proving deep results about differential equations and is covered in most introductory courses on differential geometry. It appears in unlikely fields such as game theory. In economics, Brouwer's fixed-point theorem and its extension, the Kakutani fixed-point theorem, play a central role in the proof of existence of general equilibrium in market economies as developed in the 1950s by economics Nobel prize winners Kenneth Arrow and Gérard Debreu.

The theorem was first studied in view of work on differential equations by the French mathematicians around Henri Poincaré and Charles Émile Picard. Proving results such as the Poincaré–Bendixson theorem requires the use of topological methods. This work at the end of the 19th century opened into several successive versions of the theorem. The case of differentiable mappings of the n-dimensional closed ball was first proved in 1910 by Jacques Hadamard and the general case for continuous mappings by Brouwer in 1911.

Least fixed point         
  • 17}}/2.
  • Partial order on <math>\mathbb{Z}_\bot</math>
Greatest fixed point; Least fixpoint; Greatest fixpoint
In order theory, a branch of mathematics, the least fixed point (lfp or LFP, sometimes also smallest fixed point) of a function from a partially ordered set to itself is the fixed point which is less than each other fixed point, according to the order of the poset. A function need not have a least fixed point, but if it does then the least fixed point is unique.
least fixed point         
  • 17}}/2.
  • Partial order on <math>\mathbb{Z}_\bot</math>
Greatest fixed point; Least fixpoint; Greatest fixpoint
<mathematics> A function f may have many fixed points (x such that f x = x). For example, any value is a fixed point of the identity function, ( x . x). If f is recursive, we can represent it as f = fix F where F is some higher-order function and fix F = F (fix F). The standard denotational semantics of f is then given by the least fixed point of F. This is the least upper bound of the infinite sequence (the ascending Kleene chain) obtained by repeatedly applying F to the totally undefined value, bottom. I.e. fix F = LUB bottom, F bottom, F (F bottom), .... The least fixed point is guaranteed to exist for a continuous function over a cpo. (2005-04-12)
Markov–Kakutani fixed-point theorem         
Markov-Kakutani fixed-point theorem; Markov-Kakutani fixed point theorem
In mathematics, the Markov–Kakutani fixed-point theorem, named after Andrey Markov and Shizuo Kakutani, states that a commuting family of continuous affine self-mappings of a compact convex subset in a locally convex topological vector space has a common fixed point.
fixpoint         
POINT THAT IS LEFT UNCHANGED BY A FUNCTION
Attractive fixed point; Fixpoint; Attracting fixed point; Unstable fixed point; Stable fixed point; Neutrally stable fixed point; Repulsive fixed point; Fixed point set; Invariant point; Fixed set; Attractive fixed set; Prefixpoint; Postfixpoint; Pre-fixpoint; Post-fixpoint; Double point (involution); Prefixed point; Pre-fixed point

Википедия

Fixed-point combinator

In mathematics and computer science in general, a fixed point of a function is a value that is mapped to itself by the function.

In combinatory logic for computer science, a fixed-point combinator (or fixpoint combinator): page 26  is a higher-order function fix {\displaystyle {\textsf {fix}}} that returns some fixed point of its argument function, if one exists.

Formally, if the function f has one or more fixed points, then

fix   f = f   ( fix   f )   , {\displaystyle {\textsf {fix}}\ f=f\ ({\textsf {fix}}\ f)\ ,}

and hence, by repeated application,

fix   f = f   ( f   ( f   ( fix   f ) ) )   . {\displaystyle {\textsf {fix}}\ f=f\ (f\ (\ldots f\ ({\textsf {fix}}\ f)\ldots ))\ .}